A Multi-MetaHeuristic Combined ACS-TSP System
نویسندگان
چکیده
This paper presents a Multi-MetaHeuristic combined Ant Colony System (ACS)-Travelling Salesman Problem(TSP) algorithm for solving the TSP. We introduce genetic algorithm in ACS-TSP to search solutions space for dealing with the early stagnation problem of the traveling salesman problem. Moreover, we present a new strategy of Minimum Spanning Tree (MST) coupled with Nearest Neighbor(NN) to construct a initial tour for improving TSP thus obtaining good solutions quickly. According to our simulation results, the new algorithm can provide a significantly improvement for obtaining a global optimum solution or a near global optimum solution in large TSPs.
منابع مشابه
An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem
The Generalized Traveling Salesman Problem (GTSP) is an extension of the well-known Traveling Salesman Problem (TSP), where the node set is partitioned into clusters, and the objective is to find the shortest cycle visiting each cluster exactly once. In this paper, we present a new hybrid Ant Colony System (ACS) algorithm for the symmetric GTSP. The proposed algorithm is a modification of a sim...
متن کاملACS-TS: train scheduling using ant colony system
This paper develops an algorithm for the train scheduling problem using the ant colony system metaheuristic called ACS-TS. At first, a mathematical model for a kind of train scheduling problem is developed and then the algorithm based on ACS is presented to solve the problem. The problem is considered as a traveling salesman problem (TSP) wherein cities represent the trains. ACS determines the ...
متن کاملSolving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic
The Probabilistic Traveling Salesman Problem (PTSP) is a TSP problem in which each customer has a given probability of requiring a visit. The goal is to find an a priori tour of minimal expected length over all customers, with the strategy of visiting a random subset of customers in the same order as they appear in the a priori tour. We propose an ant based a priori tour construction heuristic,...
متن کاملThe GPU-based Parallel Ant Colony System
The Ant Colony System (ACS) is, next to Ant Colony Optimization (ACO) and the MAX-MIN Ant System (MMAS), one of the most efficient metaheuristic algorithms inspired by the behavior of ants. In this article we present three novel parallel versions of the ACS for the graphics processing units (GPUs). To the best of our knowledge, this is the first such work on the ACS which shares many key elemen...
متن کاملA self-tuning Firefly algorithm to tune the parameters of Ant Colony System (ACSFA)
Ant colony system (ACS) is a promising approach which has been widely used in problems such as Travelling Salesman Problems (TSP), Job shop scheduling problems (JSP) and Quadratic Assignment problems (QAP). In its original implementation, parameters of the algorithm were selected by trial and error approach. Over the last few years, novel approaches have been proposed on adapting the parameters...
متن کامل